Layered graph approaches for combinatorial optimization problems

Graph Algorithm and Combinatorial Optimization

An Accelerator Architecture for Combinatorial Optimization Problems

In today’s world, there are many situations in which difficult decisions must be made under such constraints as a limited resource and a limited amount of time. These situations include disaster response planning, economic policy decision-making, and investment portfolio optimization. In such situations, it is often necessary to solve a “combinatorial optimization problem,” which involves evalu...

Combinatorial Optimization Methods for Problems in Genomics

I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. A PhD thesis is only the final result of years of work an...

Approximation Algorithms for Combinatorial Multicriteria Optimization Problems

The computational complexity of combinatorial multiple objective programming problems is investigated. INP-completeness and #P-completeness results are presented. Using two deenitions of approximability, general results are presented, which outline limits for approximation algorithms. The performance of the well known tree and Christoodes' heuristics for the TSP is investigated in the multicrit...

Parallel Ant Colonies for Combinatorial Optimization Problems

Ant Colonies (AC) optimization take inspiration from the behavior of real ant colonies to solve optimization problems. This paper presents a parallel model for ant colonies to solve the quadratic assignment problem (QAP). Parallelism demonstrates that cooperation between communicating agents improve the obtained results in solving the QAP. It demonstrates also that high-performance computing is...